Vertex magic total labeling of middle and total graph of cycle

Vertex magic total labeling of products of cycles

$4$-Total prime cordial labeling of some cycle related graphs

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

On vertex-magic and edge-magic total injections of graphs

The study of graph labellings has focused on finding classes of graphs which admit a particular type of labelling. Here we consider variations of the well-known edge-magic and vertex-magic total labellings for which all graphs admit such a labelling. In particular, we consider two types of injections of the vertices and edges of a graph with positive integers: (1) for every edge the sum of its ...

Super Vertex-magic Total Labelings of Graphs

Let G be a finite simple graph with v vertices and e edges. A vertex-magic total labeling is a bijection λ from V (G)∪E(G) to the consecutive integers 1, 2, · · · , v+e with the property that for every x ∈ V (G), λ(x) + Σy∈N(x)λ(xy) = k for some constant k. Such a labeling is super if λ(V (G)) = {1, · · · , v}. We study some of the basic properties of such labelings, find some families of graph...